package main

func (root *binaryTree) adds(element int, size int) {

	if element == root.element {
		return
	} else if element < root.element && root.leftNode == nil {
		size++
		root.leftNode = &binaryTree{element: element, size: size}

	} else if element > root.element && root.rightNnode == nil {
		size++
		root.rightNnode = &binaryTree{element: element, size: size}
	}
	size++
	if element < root.element {
		add(element, root.leftNode)
	} else {
		add(element, root.rightNnode)
	}
}

//func main() {
//	var BST *binaryTree
//	BST = new(binaryTree)
//	if(BST==nil){
//		fmt.Printf("6666")
//	}
//	fmt.Printf("%T\n",BST)
//	fmt.Printf("%v",BST)
//}
